Diclib.com
Dicionário ChatGPT

Pesquisa de dicionário Soluções personalizadas

Digite uma palavra ou frase em qualquer idioma 👆

Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

como a palavra é usada
frequência de uso
é usado com mais frequência na fala oral ou escrita
opções de tradução de palavras
exemplos de uso (várias frases com tradução)
etimologia

O que (quem) é exponential-time - definição

ALGORITHMIC COMPLEXITY CLASS

EXPTIME-complete; EXP; APSPACE; Exponential running time; DEXPTIME; Exponential runtime

exponential-time

<complexity> The set or property of problems which can be solved by an exponential-time algorithm but for which no polynomial-time algorithm is known. (1995-04-27)

Exponential time hypothesis

UNPROVEN COMPUTATIONAL HARDNESS ASSUMPTION THAT 3-SAT ISN’T SOLVABLE IN SUBEXPONENTIAL TIME IN THE WORST CASE

ETH (complexity); Strong exponential time hypothesis

In computational complexity theory, the exponential time hypothesis is an unproven computational hardness assumption that was formulated by . The hypothesis states that 3-SAT cannot be solved in subexponential time in the worst case.

https://en.wikipedia.org/wiki/Exponential_time_hypothesis

exponential function

MATHEMATICAL FUNCTION WITH A CONSTANT BASE AND A VARIABLE EXPONENT, DENOTED EXP_A(X) OR A^X

Complex exponential function; Complex exponential; Natural exponential function; E^x; Exp(x); Exp (programming); Complex exponentials; Real exponential function; E**x; E to the x; Cb^x; Exponential Function; Exponential equation; Exponential equations; ⅇ; Natural exponent; Exponential minus 1 function; Exponential minus 1; Expm1; Exp-1; Exp1m; Expm1(x); Exp1m(x); Natural exponential minus 1; Natural exponential; E^X-1; E^x-1; Exp(x)-1; Base e antilogarithm; Exponent of e; Base e anti-logarithm; Exponential minus one function; Exponential minus one; Natural exponential minus one; Natural exponential minus one function; Exponential near 0; Exponential near zero; Natural exponential near 0; Natural exponential near zero; Eˣ-1; Eˣ - 1; Eˣ; Eˣ−1; Eˣ − 1; E^x−1; Exp(x)−1; Exponential base

¦ noun Mathematics a function whose value is a constant raised to the power of the argument, especially the function where the constant is e.

Wikipédia

EXPTIME

In computational complexity theory, the complexity class EXPTIME (sometimes called EXP or DEXPTIME) is the set of all decision problems that are solvable by a deterministic Turing machine in exponential time, i.e., in O(2^p(n)) time, where p(n) is a polynomial function of n.

EXPTIME is one intuitive class in an exponential hierarchy of complexity classes with increasingly more complex oracles or quantifier alternations. For example, the class 2-EXPTIME is defined similarly to EXPTIME but with a doubly exponential time bound. This can be generalized to higher and higher time bounds.

EXPTIME can also be reformulated as the space class APSPACE, the set of all problems that can be solved by an alternating Turing machine in polynomial space.

EXPTIME relates to the other basic time and space complexity classes in the following way: P ⊆ NP ⊆ PSPACE ⊆ EXPTIME ⊆ NEXPTIME ⊆ EXPSPACE. Furthemore, by the time hierarchy theorem and the space hierarchy theorem, it is known that P ⊊ EXPTIME, NP ⊊ NEXPTIME and PSPACE ⊊ EXPSPACE.

https://en.wikipedia.org/wiki/EXPTIME